Analysis on a Localized Pruning Method for Connected Dominating Sets
نویسندگان
چکیده
JOHN SUM, JIE WU AND KEVIN HO Department of Information Management Chung-Shan Medical University Taichung, 402 Taiwan E-mail: [email protected] Department of Computer Science and Engineering Florida Atlantic University Boca Raton, Florida 33431, U.S.A. E-mail: [email protected] Department of Computer Science and Communication Engineering Providence University Taichung, 433 Taiwan E-mail: [email protected]
منابع مشابه
Some Analytical Results on a Localized Pruning Method for Connected Dominating Sets in MANETs
Generating a small size connected dominating set (CDS) for message routing in wireless ad hoc networks is always a challenging problem. In a recent paper, a local pruning algorithm called restricted rule-k has been proposed, and succeeds in generating a small size CDS. In this paper, a statistical analysis on the size of the CDS generated is presented. For a network of N nodes (where N → ∞) tha...
متن کاملA Generic Broadcast Protocol in Ad Hoc Networks Based on Self-Pruning
In ad hoc wireless networks, a successful broadcasting requires that the nodes forwarding the broadcast packet form a connected dominating set to ensure the coverage. An efficient broadcast method should generate a small forward node set without excessive overhead. Neighbor-knowledgebased methods, including neighbor-designating methods and self-pruning methods, are localized algorithms that red...
متن کاملMaintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clustering is an approach to simplify the network structure and thus alleviate the scalability problem. One method that has been proposed to form clusters is to use weaklyconnected dominating sets [Y.P. Chen, A.L. Liestman, App...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملThe Expected Size of the Rule k Dominating Set: II
Rule k (k=1,2,3,...) is a well known family of approximation algorithms that can be used to find connected dominating sets in a graph. They were originally proposed by Dai, Li, and Wu as the basis for efficient routing methods for ad hoc wireless networks. In this paper we study the asymptotic performance of Rules 1 and 2 on random unit disk graphs formed from n random points in an `n × `n squa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 23 شماره
صفحات -
تاریخ انتشار 2007